A strengthened formulation for the simple plant location problem with order

The Simple Plant Location Problem is well known in the literature: it consists in deciding which facilities to open among a set of potential nodes and allocating a set of customers to the open facilities in such a way that the total cost is minimum, allocation process which is carried out by the locator. However, customers may be free to choose the facility they will be allocated to. This fact can be considered by including customers’ preferences in the model, obtaining the so-called Simple Plant Location Problem with Order (SPLPO). Some new valid inequalities which reinforce the SPLPO formulation are given here and their efficiency is shown with a computational study.